The Incremental Deployability of Core-Stateless Fair Queuing
نویسندگان
چکیده
In this paper, we study the incremental deployability of the CoreStateless Fair Queuing (CSFQ) approach to provide fair rate allocations in backbone networks. We define incremental deployability as the ability of the approach to gracefully provide increasingly better quality of service with each additional QoS-aware router deployed in the network. We use the ns2 network simulator for the simulations. We conclude that CSFQ does not exhibit good incremental deployability.
منابع مشابه
Enhanced core stateless fair queuing with multiple queue priority scheduler
The Core Stateless Fair Queuing (CSFQ) is a distributed approach of Fair Queuing (FQ). The limitations include its inability to estimate fairness during large traffic flows, which are short and bursty (VoIP or video), and also it utilizes the single FIFO queue at the core router. For improving the fairness and efficiency, we propose an Enhanced Core Stateless Fair Queuing (ECSFQ) with multiple ...
متن کاملSelf-Verifying CSFQ
Recently, a class of solutions including Core-Stateless Fair Queueing (CSFQ), Rainbow Fair Queueing, and Diffserv have been proposed to address the scalability concerns that have plagued stateful architectures such as Intserv and Fair Queueing. However, despite some desirable properties, these solutions still have serious scalability, robustness, and deployment problems. Their scalability, suff...
متن کاملAdaptive CSFQ: A New Fair Queuing Mechanism for SCORE Networks
In stateless core (SCORE) networks, edge routers maintain per-flow state while core routers do not. Core stateless fair queuing (CSFQ) has been proposed for approximating the operation of per-flow queuing techniques in SCORE networks. However, the packet dropping probability offered by CSFQ suits only UDP flows. Thus, CSFQ cannot achieve fair bandwidth allocation for TCP flows. This paper propo...
متن کاملCore-Stateless Labeling Fairness: An Integrated Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks
Core-stateless mechanisms achieve better scalability by reducing the complexity of fair queuing, which usually needs to maintain states, manage buffers, and perform flow scheduling on a per-flow basis. However, they require per-packet relabeling in the core routers. In this paper, we propose a core-stateless fair bandwidth allocation scheme without maintaining per flow state in core routers. Fu...
متن کاملAnalyzing the Effect of Queuing Disciplines On Network Performance
With the increase in the number of internet users in recent times. Users are obsessed with multimedia applications available on internet, so put tremendous load on network. But network should maintain a good QoS (Quality of Service) to provide satisfactory results to the user. As congestion increases, it affects the performance of network and it tries creating imbalance. To avoid congestion man...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001